Bidirectional Contextual Grammars
نویسنده
چکیده
The present paper introduces and discusses bidirectional contextual grammars as a straightforward generalization of externally generating contextual grammars without choice. In essence, besides ordinary derivation steps, the bidirectional contextual grammars can also make reduction steps, which shorten the rewritten strings. This paper demonstrates that these grammars characterize the family of recursively enumerable languages. In fact, this characterization holds even in terms of one-turn bidirectional contextual grammars, which can change derivations steps to reduction steps during the generation process no more than once.
منابع مشابه
Reversible Uni cation Based Machine Translation
In this paper it will be shown how uniication grammars can be used to build a reversible machine translation system. Uniication grammars are often used to deene the relation between strings and meaning representations in a declarative way. Such grammars are sometimes used in a bidirectional way, thus the same grammar is used for both parsing and generation. In this paper I will show how to use ...
متن کاملContextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...
متن کاملk-Local Internal Contextual Grammars
In this paper we propose a generalization of the local internal contextual grammars, introduced by Ilie in 1997, namely the k-local internal contextual grammars. These grammars are, in fact, classical internal contextual grammars, but their only permitted derivations are those that can be described in a restricted manner (that depends on the number k). Within this formalism we define different ...
متن کاملContexts on Trajectories
We introduce and investigate a new way of generating mildly context-sensitive languages. The main idea is that the contexts are adjoined by shu ing them on certain trajectories. In this way we obtain also a very general class of contextual grammars such that most of the fundamental classes of contextual grammars, for instance, internal contextual grammars, external contextual grammars, n-contex...
متن کاملContextual Array Grammars with Matrix and Regular Control
We investigate the computational power of d-dimensional contextual array grammars with matrix control and regular control languages. For d ≥ 2, d-dimensional contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. Yet in the 1-dimensional case, for a one-letter alphabet, ...
متن کامل